Robust nonadiabatic geometric quantum computation by dynamical correction
نویسندگان
چکیده
Besides the intrinsic noise resilience property, nonadiabatic geometric phases are of fast evolution nature, and thus can naturally be used in constructing quantum gates with excellent performance, i.e., so-called computation (NGQC). However, previous single-loop NGQC schemes sensitive to operational control error, $X$ due limitations implementation. Here, we propose a robust scheme for combining dynamical correction technique, which still uses only simplified pulses, being experimental friendly. We numerically show that our greatly improve gate robustness protocols, retaining merit phases. Furthermore, fight against dephasing noise, $Z$ incorporate decoherence-free subspace encoding strategy. In this way, both types errors. Finally, also how implement on superconducting circuits experimentally demonstrated technology. Therefore, robustness, provides promising alternation future scalable fault-tolerant computation.
منابع مشابه
Nonadiabatic geometric quantum computation with trapped ions
Xin-Qi Li, Li-Xiang Cen, Guoxiang Huang, Lei Ma, and YiJing Yan National Laboratory for Superlattices and Microstructures, Institute of Semiconductors, Chinese Academy of Sciences, P.O. Box 912, Beijing 100083, China Key Laboratory for Optical and Magnetic Resonance Spectroscopy, and Department of Physics, East China Normal University, Shanghai 200062, China Department of Chemistry, Hong Kong U...
متن کاملRobust quantum computation by simulation
Simulation of quantum systems that provide intrinsically fault-tolerant quantum computation is shown to preserve fault tolerance. Errors committed in the course of simulation are eliminated by the natural error-correcting features of the systems simulated. Two examples are explored, toric codes and non-abelian anyons. The latter is shown to provide universal robust quantum computation via simul...
متن کاملRobust Geometric Computation
Geometric algorithms are often composed of a set of basic geometric predicates and constructions, also called primitives. Correctness of an algorithm is usually proved under the assumption that all primitives return the correct result. This is in sharp contrast to the naive, but common strategy of implementing such primitives with fixed-precision floating-point arithmetic. The disastrous effect...
متن کاملUnconventional geometric quantum computation.
We propose a new class of unconventional geometric gates involving nonzero dynamic phases, and elucidate that geometric quantum computation can be implemented by using these gates. Comparing with the conventional geometric gate operation, in which the dynamic phase shift must be removed or avoided, the gates proposed here may be operated more simply. We illustrate in detail that unconventional ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2022
ISSN: ['1538-4446', '1050-2947', '1094-1622']
DOI: https://doi.org/10.1103/physreva.106.012603